Lattice basis reduction: Improved practical algorithms and solving subset sum problems
نویسندگان
چکیده
منابع مشابه
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduc tion We propose a practical oating point version of the L algorithm of Lenstra Lenstra Lov asz We present a variant of the L algorithm with deep insertions and a practical algorithm for block Korkin Zolotarev reduction a concept introduced by Schnorr Empirical tests show that the strongest of these algorithms solves al most all ...
متن کاملPractical lattice basis sampling reduction
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behaviour of these algorithms. We describe how Sampling Reduction allows to stage lattice attacks against the NTRU cryptosystem with smaller BKZ parameters than before and conclude that therefore the recommeded NTRU securi...
متن کاملPractical, Predictable Lattice Basis Reduction
Lattice reduction algorithms are notoriously hard to predict, both in terms of running time and output quality, which poses a major problem for cryptanalysis. While easy to analyze algorithms with good worst-case behavior exist, previous experimental evidence suggests that they are outperformed in practice by algorithms whose behavior is still not well understood, despite more than 30 years of ...
متن کاملPractical HKZ and Minkowski Lattice Reduction Algorithms
Recently, lattice reduction has been widely used for signal detection in multiinput multioutput (MIMO) communications. In this paper, we present three novel lattice reduction algorithms. First, using a unimodular transformation, a significant improvement on an existing Hermite-Korkine-Zolotareff-reduction algorithm is proposed. Then, we present two practical algorithms for constructing Minkowsk...
متن کاملSolving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) can be briefly stated as: given a target integer E and a set A containing n positive integer aj , find a subset of A summing to E. The density d of an SSP instance is defined by the ratio of n to m, where m is the logarithm of the largest integer within A. Based on the structural and statistical properties of subset sums, we present an improved enumeration scheme fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1994
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01581144